Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization
نویسندگان
چکیده
The information provided is the sole responsibility of the authors and does not necessarily reflect the opinion of the members of IRIDIA. The authors take full responsability for any copyright breaches that may result from publication of this paper in the IRIDIA – Technical Report Series. IRIDIA is not responsible for any use that might be made of data appearing in this publication.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملTowards the Empirical Analysis of SLS Algorithms for Multiobjective Combinatorial Optimization Problems through Experimental Design
Stochastic Local Search (SLS) algorithms for Multiobjective Combinatorial Optimization Problems (MCOPs) typically involve the selection and parameterization of many algorithm components whose role with respect to their overall performance and relation to certain instance features is often not clear. This fact is becoming more problematic because of the recent trend in solving MCOPs that is givi...
متن کاملA Simple yet Efficient Multiobjective Combinatorial Optimization Method Using Decomposition and Pareto Local Search
Combining ideas from evolutionary algorithms, decomposition approaches and Pareto local search, this paper suggests a simple yet efficient memetic algorithm for combinatorial multiobjective optimization problems: MoMad. It decomposes a combinatorial multiobjective problem into a number of single objective optimization problems using an aggregation method. MoMad evolves three populations: popula...
متن کاملOn local optima in multiobjective combinatorial optimization problems
In this article, local optimality in multiobjective combinatorial optimization is used as a baseline for the design and analysis of two iterative improvement algorithms. Both algorithms search in a neighborhood that is defined on a collection of sets of feasible solutions and their acceptance criterion is based on outperformance relations. Proofs of the soundness and completeness of these algor...
متن کاملStochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategies
Pareto local search (PLS) methods are local search algorithms for multiobjective combinatorial optimization problems based on the Pareto dominance criterion. PLS explores the Pareto neighbourhood of a set of non-dominated solutions until it reaches a local optimal Pareto front. In this paper, we discuss and analyse three different Pareto neighbourhood exploration strategies: best, first, and ne...
متن کامل